Shop Cells
نویسندگان
چکیده
In this paper the Group Technology problem of grouping parts in families and machines in cells in order to convert a job shop production system to some pseudo ow shops is considered. Several heuristic methods for solving Group Technology problem have been proposed in the literature, in general, not producing a ow shop in each cell|unless a great number of extra machines is added. We use known techniques for solving the Shortest Common Supersequence and the Longest Common Subsequence problems to develop a method that takes into account the sequence of machines that each part has to visit. This new method allows us to obtain a ow shop layout for the machine cells using a limited number of machines in each cell. 2
منابع مشابه
Genetic Algorithms for Solving Scheduling Problems in Flexible Manufacturing Cells
In this paper, scheduling problems in Flexible Manufacturing Cells (FMC) are studied. The scheduling objective is to minimize the makespan. We used a genetic algorithm (GA) for solving the optimization scheduling problem. We have developed one FMC with industrial characteristics with the objective of studying scheduling problems in these types of manufacturing systems (single machine scheduling...
متن کاملR O M a Group Technology with Flow Shop Cells
In this paper the Group Technology problem of grouping parts in families and machines in cells in order to convert a job shop production system to some pseudo ow shops is considered Several heuristic methods for solving Group Technology problem have been proposed in the literature in general not producing a ow shop in each cell unless a great number of extra machines is added We use known techn...
متن کاملMixed Integer Linear Programs for Blocking and No Wait Job Shop Scheduling Problems in Robotic cells
This paper studies the problem of scheduling Job shops in robotic cells with no intermediate buffers, called No Wait Blocking Transport Job Shop Scheduling Problem (NWBT JSSP). This problem is an extension of the classical job shop problem. No Wait Blocking Transport job shop problems arise in many realistic production environments. To tackle this problem, we developed a Mixed Integer Linear Pr...
متن کاملMixed Integer Linear Programs for Blocking and No Wait Job Shop Scheduling Problems in Robotic cells
This paper studies the problem of scheduling Job shops in robotic cells with no intermediate buffers, called No Wait Blocking Transport Job Shop Scheduling Problem (NWBT JSSP). This problem is an extension of the classical job shop problem. No Wait Blocking Transport job shop problems arise in many realistic production environments. To tackle this problem, we developed a Mixed Integer Linear Pr...
متن کاملGeneralized Cyclic Open Shop Scheduling and a Hybrid Algorithm
In this paper, we first introduce a generalized version of open shop scheduling (OSS), called generalized cyclic open shop scheduling (GCOSS) and then develop a hybrid method of metaheuristic to solve this problem. Open shop scheduling is concerned with processing n jobs on m machines, where each job has exactly m operations and operation i of each job has to be processed on machine i . However...
متن کامل